A Diierent Look at Secure Distributed Computation
نویسنده
چکیده
We discuss various aspects of secure distributed computation and look at weakening both the goals of such computation and the assumed capabilities of adversaries. We present a new protocol for a conditional form of probabilistic coordination and present a model of secure distributed computation in which friendly and hostile nodes are represented in competing interwoven networks of nodes. It is suggested that reasoning about goals, risks, tradeo s, etc. for this model be done in a game-theoretic framework.
منابع مشابه
Separating indexes from data: a distributed scheme for secure database outsourcing
Database outsourcing is an idea to eliminate the burden of database management from organizations. Since data is a critical asset of organizations, preserving its privacy from outside adversary and untrusted server should be warranted. In this paper, we present a distributed scheme based on storing shares of data on different servers and separating indexes from data on a distinct server. Shamir...
متن کاملAgent Roles in Snapshot Assembly
The ability to understand running distributed computations depends on eeective monitoring techniques. Monitoring distributed systems entails two primary tasks: collecting data from the application processes and integrating it into comprehensive global views. This paper focuses on the snapshot assembly task of taking process checkpoints and forming global snapshots. The assembly task can be perf...
متن کاملTowards the global
Topological eeects produce chaos in multiagent simulation and distributed computation. We explain this result by developing three themes concerning complex systems in the natural and social sciences: (i) Pragmatically, a system is complex when it is represented eeciently by diierent models at diierent scales. (ii) Nontrivial topology, identiiable as we scale towards the global, induces complexi...
متن کاملTowards the Global : Complexity , Topology and Chaosin Modelling , Simulation And
Topological eeects produce chaos in multiagent simulation and distributed computation. We explain this result by developing three themes concerning complex systems in the natural and social sciences: (i) Pragmatically, a system is complex when it is represented eeciently by diierent models at diierent scales. (ii) Nontrivial topology, identiiable as we scale towards the global, induces complexi...
متن کاملMultiparty Computation, an Introduction
These lecture notes introduce the notion of secure multiparty computation. We introduce some concepts necessary to define what it means for a multiparty protocol to be secure, and survey some known general results that describe when secure multiparty computation is possible. We then look at some general techniques for building secure multiparty protocols, including protocols for commitment and ...
متن کامل